This is a specialization of the treetype class to the binaryspacetree tree type.
static const bool FirstPointIsCentroid = false
There is no guarantee that the first point in a node is its centroid. static const bool HasOverlappingChildren = false
Each binary space tree node has two children which represent non-overlapping subsets of the space which the node represents. static const bool HasSelfChildren = false
Points are not contained at multiple levels of the binary space tree. static const bool RearrangesDataset = true
Points are rearranged during building of the tree.
This is a specialization of the TreeType class to the BinarySpaceTree tree type.
It defines characteristics of the binary space tree, and is used to help write tree-independent (but still optimized) tree-based algorithms. See mlpack/core/tree/tree_traits.hpp for more information.
Definition at line 39 of file traits.hpp.
There is no guarantee that the first point in a node is its centroid.
Definition at line 52 of file traits.hpp.
Each binary space tree node has two children which represent non-overlapping subsets of the space which the node represents. Therefore, children are not overlapping.
Definition at line 47 of file traits.hpp.
Points are not contained at multiple levels of the binary space tree.
Definition at line 57 of file traits.hpp.
Points are rearranged during building of the tree.
Definition at line 62 of file traits.hpp.
Generated automatically by Doxygen for MLPACK from the source code.